On (Partial) unit memory codes based on Gabidulin codes
نویسندگان
چکیده
منابع مشابه
On (Partial) Unit Memory Codes Based on Gabidulin Codes
Partial) Unit Memory ((P)UM) codes provide a powerful possibility to construct convolutional codes based on block codes in order to achieve a high decoding performance. In this contribution, a construction based on Gabidulin codes is considered. This construction requires a modified rank metric, the so–called sum rank metric. For the sum rank metric, the free rank distance, the extended row ran...
متن کاملOn the Success Probability of Decoding (Partial) Unit Memory Codes
In this paper, we derive analytic expressions for the success probability of decoding (Partial) Unit Memory codes in memoryless channels. An applications of this result is that these codes outperform individual block codes in certain channels.
متن کاملOn deep-holes of Gabidulin codes
In this paper, we determine a class of deep holes for Gabidulin codes with both rank metric and Hamming metric. Moreover, we give a necessary and sufficient condition for deciding whether a word is not a deep hole for Gabidulin codes, by which we study the error distance of two special classes of words to certain Gabidulin codes.
متن کاملBounds on List Decoding Gabidulin Codes
An open question about Gabidulin codes is whether polynomial-time list decoding beyond half the minimum distance is possible or not. In this contribution, we give a lower and an upper bound on the list size, i.e., the number of codewords in a ball around the received word. The lower bound shows that if the radius of this ball is greater than the Johnson radius, this list size can be exponential...
متن کاملOn Transform–domain Decoding of Gabidulin Codes
Gabidulin codes are the rank metric analogues of Reed–Solomon codes and found many applications including network coding. Interleaving or the direct sum of Gabidulin codes allows both decreasing the redundancy and increasing the error correcting capability for network coding. In this paper, for Gabidulin codes we propose a transform–domain algorithm correcting both errors and erasures. We show ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Problems of Information Transmission
سال: 2011
ISSN: 0032-9460,1608-3253
DOI: 10.1134/s0032946011020049